#include<bits/stdc++.h>
using namespace std;
int n;
struct Node{
    int x;
    bool flag = true;
};
Node a[100010];
int t = 1;
int ans;
bool cmp(Node a1,Node a2){
    return a1.x < a2.x;
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) 
        scanf("%d",&a[i].x);
    sort(a+1,a+n+1,cmp);
    for(int i=2;i<=n;i++){
        if(a[i].x>a[t].x){
            a[t].flag = false;
            t++;
        }
    }
    for(int i=1;i<=n;i++){
        if(a[i].flag == true)
            ans++;
    }
    printf("%d",ans);
    return 0;
}